- composite transform
- составное преобразование
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
composite transform
Смотреть что такое "composite transform" в других словарях:
Composite fermion — For other uses, see Fermions#Composite fermions. A composite fermion is the bound state of an electron and an even number of quantized vortices, sometimes visually pictured as the bound state of an electron and, attached, an even number of… … Wikipedia
Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group … Wikipedia
Discrete Fourier transform (general) — See also: Fourier transform on finite groups This article is about the discrete Fourier transform (DFT) over any field (including finite fields), commonly called a number theoretic transform (NTT) in the case of finite fields. For specific… … Wikipedia
Hit-or-miss transform — In mathematical morphology, hit or miss transform is an operation that detects a given configuration (or pattern) in a binary image, using the morphological erosion operator and a pair of disjoint structuring elements. The result of the hit or… … Wikipedia
Fourier transform spectroscopy — is a measurement technique whereby spectra are collected based on measurements of the temporal coherence of a radiative source, using time domain measurements of the electromagnetic radiation or other type of radiation.It can be applied to a… … Wikipedia
Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms The Fourier transform is a mathematical operation that decomposes a function into its constituent… … Wikipedia
Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… … Wikipedia
Scale-invariant feature transform — Feature detection Output of a typical corner detection algorithm … Wikipedia
Hilbert-Huang transform — The Hilbert Huang Transform (HHT) is a way to decompose a signal into so called intrinsic mode functions (IMF), and obtain instantaneous frequency data. It is designed to work well for data that are nonstationary and nonlinear. In contrast to… … Wikipedia
Extract, transform, load — Extract, transform and load (ETL) is a process in database usage and especially in data warehousing that involves: Extracting data from outside sources Transforming it to fit operational needs (which can include quality levels) Loading it into… … Wikipedia
Fast Fourier Transform — Transformée de Fourier rapide La transformée de Fourier rapide (sigle anglais : FFT ou Fast Fourier Transform) est un algorithme de calcul de la transformée de Fourier discrète (TFD). Sa complexité varie en avec le nombre de points n, alors… … Wikipédia en Français
